Variance Bounding Markov Chains 1203 Theorem
نویسندگان
چکیده
We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L2 functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Peskun order. We close with some applications to Metropolis–Hastings algorithms.
منابع مشابه
Variance Bounding Markov Chains
We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Pesk...
متن کاملVariance Bounding Markov Chains by Gareth
We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Pesk...
متن کاملVariance Estimation in the Central Limit Theorem for Markov Chains
This article concerns the variance estimation in the central limit theorem for finite recurrent Markov chains. The associated variance is calculated in terms of the transition matrix of the Markov chain. We prove the equivalence of different matrix forms representing this variance. The maximum likelihood estimator for this variance is constructed and it is proved that it is strongly consistent ...
متن کاملNorm Comparisons for Data Augmentation
This short paper considers comparisons of different data augmentation algorithms in terms of their convergence and efficiency. It examines connections between the partial order 1 on Markov kernels, and inequalities of operator norms. It applies notions from Roberts and Rosenthal (2006) related to variance bounding Markov chains, together with L2 theory, to data augmentation algorithms (Tanner a...
متن کاملA Local Limit Theorem for a Family of Non-reversible Markov Chains
Abstract. By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are not reversible, have little symmetry, do not have uniform stationary distributions, and can be nearly periodic, prior general bounds on rates of c...
متن کامل